Rounding Probabilistic Expectations in Surveys.
نویسندگان
چکیده
Rounding is the familiar practice of reporting one value whenever a real number lies in an interval. Uncertainty about the extent of rounding is common when researchers analyze survey responses to numerical questions. The prevalent practice has been to take numerical responses at face value, even though many may in fact be rounded. This paper studies the rounding of responses to survey questions that ask persons to state the percent-chance that some future event will occur. We analyze data from the Health and Retirement Study and find strong evidence of rounding, the extent of rounding differing across respondents. We propose use of a person's response pattern across different questions to infer his rounding practice, the result being interpretation of reported numerical values as interval data. We then bring to bear recent developments on statistical analysis of interval data to characterize the potential consequences of rounding for empirical research. Finally, we propose enrichment of surveys by probing to learn the extent and reasons for rounding.
منابع مشابه
- 1 - Measuring Subjective Expectations in Developing Countries : A Critical Review and New
The majority of economic decisions are forward looking and thus involve expectations of future outcomes. Understanding the expectations that individuals have is thus of crucial importance to designing and evaluating policies in health, education, finance, migration, social protection, and many other areas. However, the majority of developing country surveys are static in nature and many do not ...
متن کاملRandomized Rounding without Solving the Linear Program 33
We introduce a new technique called oblivious rounding | a variant of randomized rounding that avoids the bottleneck of rst solving the linear program. Avoiding this bottleneck yields more eecient algorithms and brings probabilistic methods to bear on a new class of problems. We give oblivious rounding algorithms that approximately solve general packing and covering problems, including a parall...
متن کاملGeometric Rounding: A Dependent Rounding Scheme for Allocation Problems
This paper presents a general technique to develop approximation algorithms for allocation problems with integral assignment constraints. The core of the method is a randomized dependent rounding scheme, called geometric rounding, which yields termwise rounding ratios (in expectation), while emphasizing the strong correlation between events. We further explore the intrinsic geometric structure ...
متن کاملDependent Rounding in Bipartite Graphs
We combine the pipage rounding technique of Ageev & Sviridenko witha recent rounding method developed by Srinivasan, to develop a new randomized rounding approach for fractional vectors defined on the edge-sets of bipartite graphs. We show various ways of combining this technique with other ideas, leading to the following applications: richer random-graph models for graphs with a given degree-s...
متن کاملCse525: Randomized Algorithms and Probabilistic Analysis Lecture 4
One useful application of random algorithms is to approximate NP-hard problems: although there is no known polynomial time algorithm for finding the optimal solution these problems, it is often possible to find a randomized algorithm that can find an approximately optimal solution. One common method for doing this is called Randomized Rounding of Linear Programs(LPs). The basic idea is to take ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of business & economic statistics : a publication of the American Statistical Association
دوره 28 2 شماره
صفحات -
تاریخ انتشار 2010